Polar Codes for Arbitrary Classical-Quantum Channels and Arbitrary cq-MACs

Polar codes for Arbitrary DMCs

Polar codes are constructed for arbitrary channels by imposing an arbitrary quasigroup structure on the input alphabet. Just as with “usual” polar codes, the block error probability under successive cancellation decoding is o(2−N 1/2− ), where N is the block length. The encoding and decoding in this coding scheme can be implemented with a complexity of O(N logN). It is shown that the same techn...

Optimal Streaming Codes for Channels with Burst and Arbitrary Erasures

This paper considers transmitting a sequence of messages (a streaming source) over a packet erasure channel. In each time slot, the source constructs a packet based on the current and the previous messages and transmits the packet, which may be erased when the packet travels from the source to the destination. Every source message must be recovered perfectly at the destination subject to a fixe...

Quantum Coding Theorems for Arbitrary Sources, Channels and Entanglement Resources

The information spectrum approach gives general formulae for optimal rates of various information theoretic protocols, under minimal assumptions on the nature of the sources, channels and entanglement resources involved. This paper culminates in the derivation of the dense coding capacity for a noiseless quantum channel, assisted by arbitrary shared entanglement, using this approach. We also re...

CBC MACs for Arbitrary-Length Messages: The Three-Key Constructions

Concatenated Capacity-Achieving Polar Codes for Optical Quantum Channels

We construct concatenated capacity-achieving quantum codes for noisy optical quantum channels. We demonstrate that the error-probability of capacityachieving quantum polar encoding can be reduced by the proposed low-complexity concatenation scheme. OCIS codes: (270.5585); (270.5565).